Online Makespan Minimization with Parallel Schedules
نویسندگان
چکیده
منابع مشابه
Makespan minimization in online scheduling with machine eligibility
In this paper we provide a survey of online scheduling in parallel machine environments with machine eligibility constraints and the makespan as objective function. We first give a brief overview of the different parallel machine environments and then survey the various types of machine eligibility constraints, including treehierarchical processing sets, Grade of Service processing sets, interv...
متن کاملMakespan Minimization with Machine Availability Constraints
We investigate the problems of scheduling n jobs tom = m1+ m2 identical machines where m1 machines are always available, m2 machines have some specified unavailable intervals.The objective is tominimize the makespan. We assume that if a job is interrupted by the unavailable interval, it can be resumed after the machine becomes available. We show that if at least one machine is always available,...
متن کاملOnline Makespan Scheduling of Linear Deteriorating Jobs on Parallel Machines
Traditional scheduling assumes that the processing time of a job is fixed. Yet there are numerous situations that the processing time increases (deteriorates) as the start time increases. Examples include scheduling cleaning or maintenance, fire fighting, steel production and financial management. Scheduling of deteriorating jobs was first introduced on a single machine by Browne and Yechiali, ...
متن کاملMakespan Minimization on Parallel Batch Processing Machines with Release Times and Job Sizes
This paper investigates the scheduling problem of minimizing makespan on parallel batch processing machines encountered in different manufacturing environments, such as the burn-in operation in the manufacture of semiconductors and the aging test operation in the manufacture of thin film transistor-liquid crystal displays (TFT-LCDs). Each job is characterized by a processing time, a release tim...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2016
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-016-0172-5